Finite automata on directed graphs
نویسندگان
چکیده
منابع مشابه
Automata on Directed Graphs: Edge Versus Vertex Marking
We investigate two models of finite-state automata that operate on rooted directed graphs by marking either vertices (V-automata) or edges (E-automata). Runs correspond to locally consistent markings and acceptance is defined by means of regular conditions on the paths emanating from the root. Comparing the expressive power of these two notions of graph acceptors, we show that E-automata are mo...
متن کاملOn congruences of automata defined by directed graphs
Graphs and various objects derived from them are basic essential tools that have been actively used in various branches of modern theoretical computer science. In particular, graph grammars and graph transformations have been very well explored in the literature. We consider finite state automata defined by directed graphs, characterize all their congruences, and give a complete description of ...
متن کاملDAGGER: A Toolkit for Automata on Directed Acyclic Graphs
This paper presents DAGGER, a toolkit for finite-state automata that operate on directed acyclic graphs (dags). The work is based on a model introduced by (Kamimura and Slutzki, 1981; Kamimura and Slutzki, 1982), with a few changes to make the automata more applicable to natural language processing. Available algorithms include membership checking in bottom-up dag acceptors, transduction of dag...
متن کاملIndependent domination in directed graphs
In this paper we initialize the study of independent domination in directed graphs. We show that an independent dominating set of an orientation of a graph is also an independent dominating set of the underlying graph, but that the converse is not true in general. We then prove existence and uniqueness theorems for several classes of digraphs including orientations of complete graphs, paths, tr...
متن کاملThe halting problem for chip-firing on finite directed graphs
We consider a chip-firing game on finite directed graphs and give an answer to a question posed by Bjorner, Lovasz, and Shor in 1991: given an initial configuration of chips, when does it stabilize? The approach they took to address this halting problem involves computing a period vector p with the property that toppling the vertices according to p results in the original configuration, and the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1992
ISSN: 0022-0000
DOI: 10.1016/0022-0000(92)90012-8